#include<bits/stdc++.h>
using namespace std;
int main() {
int m;
cin >> m;
int c2 = 0, c5 = 0;
int i = 2;
while(1) {
int t = i;
while(t%2==0) {
t /= 2;
c2++;
}
t = i;
while(t%5==0) {
t /= 5;
c5++;
}
//cout << c2 << " " << c5 << endl;
if(c2>m and c5>m) {
cout << 0;
return 0;
}
if(min(c2,c5)==m) {
cout << 5 << endl;
for(int j = 0; j < 5; j++) {
cout << i++ << " ";
}
return 0;
}
i++;
}
}
1920. Build Array from Permutation | 494. Target Sum |
797. All Paths From Source to Target | 1547B - Alphabetical Strings |
1550A - Find The Array | 118B - Present from Lena |
27A - Next Test | 785. Is Graph Bipartite |
90. Subsets II | 1560A - Dislike of Threes |
36. Valid Sudoku | 557. Reverse Words in a String III |
566. Reshape the Matrix | 167. Two Sum II - Input array is sorted |
387. First Unique Character in a String | 383. Ransom Note |
242. Valid Anagram | 141. Linked List Cycle |
21. Merge Two Sorted Lists | 203. Remove Linked List Elements |
733. Flood Fill | 206. Reverse Linked List |
83. Remove Duplicates from Sorted List | 116. Populating Next Right Pointers in Each Node |
145. Binary Tree Postorder Traversal | 94. Binary Tree Inorder Traversal |
101. Symmetric Tree | 77. Combinations |
46. Permutations | 226. Invert Binary Tree |